An (18/11)n upper bound for sorting by prefix reversals
نویسندگان
چکیده
Thepancake problemasks for theminimumnumber of prefix reversals sufficient for sorting any permutation of length n. We improve the upper bound for the pancake problem to (18/11)n+ O(1) ≈ (1.6363)n. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Sorting by Prefix Reversals
The pancake problem, which has attracted considerable attention, concerns the number of prefix reversals needed to sort the elements of an arbitrary permutation. The number of prefix reversals to sort permutations is also the diameter of the often studied n-dimensional Pancake network. We consider restricted pancake problem, when only k of the possible n− 1 prefix reversals are allowed.
متن کاملPancake Flipping with Two Spatulas
In this paper we study several variations of the pancake flipping problem, which is also well known as the problem of sorting by prefix reversals. We consider the variations in the sorting process by adding with prefix reversals other similar operations such as prefix transpositions and prefix transreversals. These type of sorting problems have applications in interconnection networks and compu...
متن کاملSorting by Prefix Reversals and Prefix Transpositions with Forward March
Sorting permutations by reversals and/or transpositions is an important genome rearrangement problem in computational molecular biology. From theoretical point of view, finding efficient algorithms for this problem and its variations are quite challenging. In this paper we consider the problem of sorting unsigned permutations by prefix reversals and prefix transpositions, where a prefix reversa...
متن کامل. C O ] 4 J ul 2 00 6 Prefix reversals on binary and ternary strings ⋆
Given a permutation π, the application of prefix reversal f (i) to π reverses the order of the first i elements of π. The problem of Sorting By Prefix Reversals (also known as pancake flipping), made famous by Gates and Papadimitriou (Bounds for sorting by prefix reversal, Discrete Mathematics 27, pp. 47-57), asks for the minimum number of prefix reversals required to sort the elements of a giv...
متن کاملPrefix Reversals on Binary and Ternary Strings
Given a permutation π, the application of prefix reversal f (i) to π reverses the order of the first i elements of π. The problem of sorting by prefix reversals (also known as pancake flipping), made famous by Gates and Papadimitriou (Discrete Math., 27 (1979), pp. 47–57), asks for the minimum number of prefix reversals required to sort the elements of a given permutation. In this paper we stud...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2009